منابع مشابه
Error-resilient Dna Computation Ecole Normale Supérieure De Lyon Error-resilient Dna Computation Error-resilient Dna Computation
The DNA model of computation with test tubes of DNA molecules encoding bit sequences is based on three primitives Extract A Bit Merge Two Tubes and Detect Emptiness Perfect operations can test the satis ability of any boolean formula in linear time However in re ality the Extract operation is faulty We determine the minimum num ber of faulty Extract operations required to simulate a single high...
متن کاملAnnotation-Guided Soft-Error Injection
This paper introduces FITIn, a new fault-injection tool that supports instrumentation-based injections that are guided by annotations of the source code; FITIn allows for highly selective fault-injection tests. FITIn is implemented on top of the Valgrind framework. We present the major design decisions of FITIn and evaluate it using the Dhrystone benchmark.
متن کاملUnbounded-error quantum computation with small space bounds
We prove the following facts about the language recognition power of quantum Turing machines (QTMs) in the unbounded error setting: QTMs are strictly more powerful than probabilistic Turing machines for any common space bound s satisfying s(n) = o(log log n). For " one-way " Turing machines, where the input tape head is not allowed to move left, the above result holds for s(n) = o(log n). We al...
متن کاملTwo-Party Zero-Error Function Computation with Asymmetric Priors
We consider a two party network where each party wishes to compute a function of two correlated sources. Each source is observed by one of the parties. The true joint distribution of the sources is known to one party. The other party, on the other hand, assumes a distribution for which the set of source pairs that have a positive probability is only a subset of those that may appear in the true...
متن کاملFault-Tolerant Quantum Computation with Constant Error Rate
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmically, an assumption which is physically unreasonable. This paper improves this result and shows that quantum computation can be made robust against errors and inaccuracies, when the error rate, η, is smaller than a co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 1988
ISSN: 0895-7177
DOI: 10.1016/0895-7177(88)90669-3